Anytime algorithm - PDFSEARCH.IO - Document Search Engine

Anytime algorithm
Results: 32

#	Item
21	UNIVERSITY OF MASSACHUSETTS AMHERST Resource-Bounded Reasoning Lab Contact Information Computer Science Building University of Massachusetts Add to Reading List Source URL: anytime.cs.umass.edu Language: English - Date: 2011-02-22 15:07:18 Anytime algorithm Agent-based model Multi-agent planning Computing Automated planning and scheduling Reinforcement learning Computational intelligence Artificial intelligence Multi-agent systems Science
22	Point-based value iteration: An anytime algorithm for POMDPs Joelle Pineau, Geoff Gordon and Sebastian Thrun Carnegie Mellon University Robotics Institute 5000 Forbes Avenue Pittsburgh, PA 15213 Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2003-06-04 12:29:32 Stochastic control Control theory Partially observable Markov decision process Markov decision process Automated planning and scheduling Reinforcement learning Monte Carlo POMDP Statistics Dynamic programming Markov processes
23	ARA: Anytime A with Provable Bounds on Sub-Optimality Maxim Likhachev, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2004-01-17 12:21:05 Search algorithms Theoretical computer science Graph theory Operations research Routing algorithms A* search algorithm Heuristic function Mathematical optimization Shortest path problem Mathematics Applied mathematics Heuristics
24	Anytime Dynamic A: An Anytime, Replanning Algorithm Maxim Likhachev† , Dave Ferguson† , Geoff Gordon† , Anthony Stentz† , and Sebastian Thrun‡ † School of Computer Science Carnegie Mellon University Add to Reading List Source URL: www.cs.cmu.edu Language: English* - Date: 2005-03-22 19:40:28 Artificial intelligence A* search algorithm D* Heuristic function Sven Koenig Dynamic programming Algorithm Motion planning Best-first search Search algorithms Mathematics Applied mathematics
25	A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games H. Brendan McMahan∗ Google, Inc[removed]Forbes Avenue Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-06-26 10:47:41 Operations research Game theory Convex analysis Mathematical economics Minimax Function Convex function Linear programming Vector space Mathematics Mathematical optimization Algebra
26	Anytime Lifted Belief Propagation Rodrigo de Salvo Braz ∗ Sriraam Natarajan † Hung Bui ∗ Jude Shavlik † Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2009-05-29 13:49:03 Mathematical logic Automated theorem proving Statistics Applied mathematics Theoretical computer science Belief propagation Algorithm Resolution Unification Mathematics Graphical models Bayesian statistics
27	Metareasoning Stuart J. Russell Computer Science Division University of California, Berkeley November 21, 1997 Metareasoning is \reasoning about reasoning"\|in its broadest sense, any computational Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2011-03-23 22:57:04 Inductive reasoning Reasoning Anytime algorithm Machine learning Algorithm Bounded rationality Cognitive architecture Lookahead Logic programming Artificial intelligence Science Cognition
28	Rationality and Intelligence Stuart Russell Computer Science Division University of California Berkeley, CA 94720, USA Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2005-11-17 20:09:32 Ethology Rationality Rational agent Reinforcement learning Intelligent agent Agent-based model Anytime algorithm Complexity Agent Artificial intelligence Science Knowledge
29	Multi-Fidelity Algorithms for Interactive Mobile Applications M. Satyanarayanan and Dushyanth Narayanan School of Computer Science Carnegie Mellon University The concept of an algorithm has proved robust over half a cent Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-01-03 12:20:00 Theoretical computer science Computer science Mathematical logic Distributed computing Medical algorithm Anytime algorithm Randomized algorithm Computational complexity theory Parallel computing Algorithms Applied mathematics Mathematics
30	Costly Valuation Computation in Auctions Kate Larson and Tuomas Sandholm * Computer Science Department Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA[removed]USA Add to Reading List Source URL: www.tark.org Language: English - Date: 2011-10-23 10:31:50 Vickrey auction First-price sealed-bid auction Agent-based model Anytime algorithm Reverse auction Auction Randomized algorithm Algorithm Combinatorial auction Auctioneering Auction theory Business

UPDATE